TSTP Solution File: SET593^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET593^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:54:27 EDT 2024
% Result : Theorem 0.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 6 unt; 6 typ; 0 def)
% Number of atoms : 50 ( 0 equ; 0 cnn)
% Maximal formula atoms : 21 ( 2 avg)
% Number of connectives : 151 ( 36 ~; 25 |; 15 &; 67 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 14 ( 0 ^ 14 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
epred1_0: a > $o ).
thf(decl_23,type,
epred2_0: a > $o ).
thf(decl_24,type,
epred3_0: a > $o ).
thf(decl_25,type,
esk1_0: a ).
thf(decl_26,type,
esk2_0: a ).
thf(cBOOL_PROP_52_pme,conjecture,
! [X1: a > $o,X2: a > $o,X3: a > $o] :
( ! [X4: a] :
( ( X1 @ X4 )
=> ( ( X2 @ X4 )
| ( X3 @ X4 ) ) )
=> ( ! [X4: a] :
( ( ( X1 @ X4 )
& ~ ( X2 @ X4 ) )
=> ( X3 @ X4 ) )
& ! [X4: a] :
( ( ( X1 @ X4 )
& ~ ( X3 @ X4 ) )
=> ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_52_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o,X3: a > $o] :
( ! [X4: a] :
( ( X1 @ X4 )
=> ( ( X2 @ X4 )
| ( X3 @ X4 ) ) )
=> ( ! [X4: a] :
( ( ( X1 @ X4 )
& ~ ( X2 @ X4 ) )
=> ( X3 @ X4 ) )
& ! [X4: a] :
( ( ( X1 @ X4 )
& ~ ( X3 @ X4 ) )
=> ( X2 @ X4 ) ) ) ),
inference(assume_negation,[status(cth)],[cBOOL_PROP_52_pme]) ).
thf(c_0_2,negated_conjecture,
! [X14: a] :
( ( ~ ( epred1_0 @ X14 )
| ( epred2_0 @ X14 )
| ( epred3_0 @ X14 ) )
& ( ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred2_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk2_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk2_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred2_0 @ esk2_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk2_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk2_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred2_0 @ esk2_0 )
| ~ ( epred3_0 @ esk1_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
( ~ ( epred3_0 @ esk2_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X4: a] :
( ( epred2_0 @ X4 )
| ( epred3_0 @ X4 )
| ~ ( epred1_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ~ ( epred2_0 @ esk2_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
( ~ ( epred3_0 @ esk2_0 )
| ~ ( epred3_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
~ ( epred2_0 @ esk1_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]),c_0_6]) ).
thf(c_0_9,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
~ ( epred3_0 @ esk2_0 ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_4]),c_0_8]),c_0_9]) ).
thf(c_0_11,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
( ( epred2_0 @ esk2_0 )
| ~ ( epred1_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_4]) ).
thf(c_0_13,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_14,negated_conjecture,
( ~ ( epred2_0 @ esk2_0 )
| ~ ( epred3_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
epred1_0 @ esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
thf(c_0_16,negated_conjecture,
~ ( epred2_0 @ esk2_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_4]),c_0_15])]),c_0_8]) ).
thf(c_0_17,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ~ ( epred3_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_18,negated_conjecture,
~ ( epred1_0 @ esk2_0 ),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_4]),c_0_15])]),c_0_18]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SET593^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 12:08:53 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running higher-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.47 # Version: 3.1.0-ho
% 0.18/0.47 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.18/0.47 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting post_as_ho12 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_9 with 300s (1) cores
% 0.18/0.47 # Starting post_as_ho1 with 300s (1) cores
% 0.18/0.47 # Starting post_as_ho4 with 300s (1) cores
% 0.18/0.47 # Starting post_as_ho2 with 300s (1) cores
% 0.18/0.47 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.18/0.47 # Starting full_lambda_10 with 300s (1) cores
% 0.18/0.47 # Starting new_ho_8 with 300s (1) cores
% 0.18/0.47 # new_bool_9 with pid 25668 completed with status 0
% 0.18/0.47 # Result found by new_bool_9
% 0.18/0.47 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.18/0.47 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting post_as_ho12 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_9 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.18/0.47 # Search class: HGHNF-FFSF00-SSSFFFNN
% 0.18/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting sh3 with 163s (1) cores
% 0.18/0.47 # sh3 with pid 25675 completed with status 0
% 0.18/0.47 # Result found by sh3
% 0.18/0.47 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.18/0.47 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting post_as_ho12 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_9 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.18/0.47 # Search class: HGHNF-FFSF00-SSSFFFNN
% 0.18/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting sh3 with 163s (1) cores
% 0.18/0.47 # Preprocessing time : 0.001 s
% 0.18/0.47 # Presaturation interreduction done
% 0.18/0.47
% 0.18/0.47 # Proof found!
% 0.18/0.47 # SZS status Theorem
% 0.18/0.47 # SZS output start CNFRefutation
% See solution above
% 0.18/0.47 # Parsed axioms : 2
% 0.18/0.47 # Removed by relevancy pruning/SinE : 1
% 0.18/0.47 # Initial clauses : 10
% 0.18/0.47 # Removed in clause preprocessing : 0
% 0.18/0.47 # Initial clauses in saturation : 10
% 0.18/0.47 # Processed clauses : 27
% 0.18/0.47 # ...of these trivial : 0
% 0.18/0.47 # ...subsumed : 0
% 0.18/0.47 # ...remaining for further processing : 26
% 0.18/0.47 # Other redundant clauses eliminated : 0
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 8
% 0.18/0.47 # Backward-rewritten : 1
% 0.18/0.47 # Generated clauses : 8
% 0.18/0.47 # ...of the previous two non-redundant : 8
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 4
% 0.18/0.47 # Paramodulations : 8
% 0.18/0.47 # Factorizations : 0
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 0
% 0.18/0.47 # Disequality decompositions : 0
% 0.18/0.47 # Total rewrite steps : 3
% 0.18/0.47 # ...of those cached : 2
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 7
% 0.18/0.47 # Positive orientable unit clauses : 1
% 0.18/0.47 # Positive unorientable unit clauses: 0
% 0.18/0.47 # Negative unit clauses : 4
% 0.18/0.47 # Non-unit-clauses : 2
% 0.18/0.47 # Current number of unprocessed clauses: 0
% 0.18/0.47 # ...number of literals in the above : 0
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 19
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 8
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 8
% 0.18/0.47 # Non-unit clause-clause subsumptions : 4
% 0.18/0.47 # Unit Clause-clause subsumption calls : 10
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 1
% 0.18/0.47 # BW rewrite match successes : 1
% 0.18/0.47 # Condensation attempts : 0
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 640
% 0.18/0.47 # Search garbage collected termcells : 197
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.001 s
% 0.18/0.47 # System time : 0.003 s
% 0.18/0.47 # Total time : 0.003 s
% 0.18/0.47 # Maximum resident set size: 1800 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.002 s
% 0.18/0.47 # System time : 0.004 s
% 0.18/0.47 # Total time : 0.006 s
% 0.18/0.47 # Maximum resident set size: 1712 pages
% 0.18/0.47 % E---3.1 exiting
% 0.18/0.47 % E exiting
%------------------------------------------------------------------------------